Ideal 9th-order multigrades and Letac’s elliptic curve
نویسندگان
چکیده
منابع مشابه
Ideal 9th-order Multigrades and Letac's Elliptic Curve
By showing that the elliptic curve (x2 13)(y2 13) = 48 has infinitely many rational points, we prove that Letac's construction produces infinitely many genuinely different ideal 9th-order multigrades. We give one (not very small) new example, and, by finding the Mordell-Weil group of the curve, show how to find all examples obtainable by Letac's method.
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملElliptic and Hyperelliptic Curve Cryptography
Definition 1. Let k be a field. An algebraic variety over k is a k-scheme X such that there exists a covering by a finite number of affine open subschemes Xi which are affine varieties over k, i.e. each Xi is the affine scheme associated to a finitely generated algebra over k. A projective variety over k is a projective scheme over k, i.e. a k-scheme isomorphic to Proj k[T0, . . . , Tn]/I for a...
متن کاملHyper-and-elliptic-curve cryptography
This paper introduces “hyper-and-elliptic-curve cryptography”, in which a single high-security group supports fast genus-2-hyperelliptic-curve formulas for variable-base-point single-scalar multiplication (e.g., Diffie–Hellman shared-secret computation) and at the same time supports fast elliptic-curve formulas for fixed-base-point scalar multiplication (e.g., key generation) and multi-scalar m...
متن کاملRunning title : A Fast Implementation of Elliptic Curve Cryptosystem with Prime Order A Fast Implementation of Elliptic Curve Cryptosystem with Prime Order Defined over Fp8
Public key cryptosystem has many uses, such as to sign digitally, to realize electronic commerce. Especially, RSA public key cryptosystem has been the most widely used, but its key for ensuring sufficient security reaches about 2000 bits long. On the other hand, elliptic curve cryptosystem(ECC) has the same security level with about 7-fold smaller length key. Accordingly, ECC has been received ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1991
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1991-1094960-9